Parallel Pattern Matching with Scaling
نویسندگان
چکیده
منابع مشابه
Parallel Bi-dimensional Pattern Matching with Scaling
This paper deals with the problem of bi-dimensional pattern matching with scaling. The problem is to find all occurrences of the m m pattern in the N N text, scaled to all natural multiples. We have proposed an efficient parallel algorithm for this problem on CREW-PRAM with p2 processors. It takes O(N2 p2 ) time.
متن کاملEfficient Two-Dimensional Parallel Pattern Matching with Scaling
Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. In this paper we assume that the pattern can be scaled. We propose a new par...
متن کاملA Range Minima Parallel Algorithm for Coarse Grained Multicomputers
Given an array of n real numbers A = (a1; a2; : : : ; an), de ne MIN(i; j) = minfai; : : : ; ajg. The range minima problem consists of preprocessing array A such that queries MIN(i; j), for any 1 i j n, can be answered in constant time. Range minima is a basic problem that appears in many other important problems such as lowest common ancestor, Euler tour, pattern matching with scaling, etc. In...
متن کاملScalable RDF query processing on clusters and supercomputers
The proliferation of RDF data on the web has increased the need for systems that can query these data while scaling with their growing size and number. We present an application of parallel hash-joins for basic graph pattern matching over large amounts of RDF designed for shared nothing architectures including high-performance clusters and the Blue Gene/L. Our approach does not require any pre-...
متن کاملFast algorithm for point pattern matching: Invariant to translations, rotations and scale changes
-Based on 2-D cluster approach, a fast algorithm for point pattern matching is proposed to effectively solve the problems of optimal matches between two point pattern under geometrical transformation and correctly identify the missing or spurious points of patterns. Theorems and algorithms are developed to determine the matching pairs support of each point pair and its transformation parameters...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 11 شماره
صفحات -
تاریخ انتشار 2001